Four Short Stories about Toeplitz Matrix Calculations
نویسندگان
چکیده
Abstract. The stories told in this paper are dealing with the solution of finite, infinite, and biinfinite Toeplitz-type systems. A crucial role plays the off-diagonal decay behavior of Toeplitz matrices and their inverses. Classical results of Gelfand et al. on commutative Banach algebras yield a general characterization of this decay behavior. We then derive estimates for the approximate solution of (bi)infinite Toeplitz systems by the finite section method, showing that the approximation rate depends only on the decay of the entries of the Toeplitz matrix and its condition number. Furthermore, we give error estimates for the solution of doubly infinite convolution systems by finite circulant systems. Finally, some quantitative results on the construction of preconditioners via circulant embedding are derived, which allow to provide a theoretical explanation for numerical observations made by some researchers in connection with deconvolution problems.
منابع مشابه
Parallel Computation of the Eigenstructure of Toeplitz-plus-Hankel Matrices on Multicomputers
In this paper we present four parallel algorithms to compute any group of eigenvalues and eigenvectors of a Toeplitz-plus-Hankel matrix. These algorithms parallelize a method that combines the bisection technique with a fast root-finding procedure to obtain each eigenvalue. We design a parallel algorithm that applies a static distribution of the calculations among processors and three algorithm...
متن کاملAn application of Fibonacci numbers into infinite Toeplitz matrices
The main purpose of this paper is to define a new regular matrix by using Fibonacci numbers and to investigate its matrix domain in the classical sequence spaces $ell _{p},ell _{infty },c$ and $c_{0}$, where $1leq p
متن کاملFast Cauchy-like and Singular Toeplitz-like Matrix Computations
computes the solution ~ x = T ?1 ~ b to a nonsingular Toeplitz or Toeplitz-like linear system T~ x = ~ b, a short displacement generator for the inverse T ?1 of T, and det T. We extend this algorithm to the similar computations with nn Cauchy (generalized Hilbert) and Cauchy-like matrices. Recursive triangular factorization of such a matrix can be computed by our algorithm at the cost of execut...
متن کاملParallelizing the Conjugate Gradient Algorithm for Multilevel Toeplitz Systems
Multilevel Toeplitz linear systems appear in a wide range of scientific and engineering applications. While several fast direct solvers exist for the basic 1-level Toeplitz matrices, in the multilevel case an iterative solver provides the most general and practical solution. Furthermore, iterative methods are asymptotically faster than many stable direct methods even for the 1-level case. This ...
متن کاملF-electron spectral function of the Falicov-Kimball model and the Wiener-Hopf sum equation approach
We derive an alternative representation for the f -electron spectral function of the Falicov-Kimball model from the original one proposed by Brandt and Urbanek. In the new representation, all calculations are restricted to the real time axis, allowing us to go to arbitrarily low temperatures. The general formula for the retarded Green’s function involves two determinants of continuous matrix op...
متن کامل